An Approximation Algorithm for a Bottleneck Traveling Salesman Problem

Consider a truck running along a road. It picks up a load Li at point βi and delivers it at αi, carrying at most one load at a time. The speed on the various parts of the road in one direction is given by f(x) and that in the other direction is given by g(x). Minimizing the total time spent to deliver loads L1, . . . , Ln is equivalent to solving the Traveling Salesman Problem (TSP) where the cities correspond to the loads Li with coordinates (αi, βi) and the distance from Li to Lj is given by ∫ βj αi f(x)dx if βj ≥ αi and by ∫ αi βj g(x)dx if βj < αi. This case of TSP is polynomially solvable with significant real-world applications. Gilmore and Gomory obtained a polynomial time solution for this TSP [5]. However, the bottleneck version of the problem (BTSP) was left open. Recently, Vairaktarakis showed that BTSP with this distance metric is NP-complete [9]. We provide an approximation algorithm for this BTSP by exploiting the underlying geometry in a novel fashion. This also allows for an alternate analysis of Gilmore and Gomory’s polynomial time algorithm for the TSP. We achieve an approximation ratio of (2 + γ) where γ ≥ f(x) g(x) ≥ 1 γ ∀x. Note that when f(x) = g(x), the approximation ratio is 3.